(A) Subset of LUT entries of an example automaton
that prescribe state transitions to
on (1); white (black) states are 0 (1). (B) Wildcard schema redescription; wildcards denoted also by grey states. Schema
is highlighted to identify the subset of LUT entries
it redescribes. (C) Two-symbol schema redescription, using the additional position-free symbol; the entire set
is compressed into a single two-symbol schema:
. Any permutation of the inputs marked with the position-free symbol in
results in a schema in
. Note that
redescribes the entire set of entries with transition to
on and thus
. Since there is only one set of marked inputs, the position-free symbol does not require an index. Although this figure depicts only the schemata obtained for the subset of LUT entries of
that transition to
on, entries that do not match any of these schemata transition to
off (since
is a Boolean automaton).